On block irreducible forms over Euclidean domains
نویسندگان
چکیده
منابع مشابه
Revisiting strong Gröbner bases over Euclidean domains
Buchberger and Kandri−Rody and Kapur defined a strong Gröbner basis for a polynomial ideal over a Euclidean domain in a way that gives rise to canonical reductions. This retains what is perhaps the most important property of Gröbner bases over fields. A difficulty is that these can be substantially harder to compute than their field counterparts. We extend their results for computing these base...
متن کاملOn Shift Radix Systems over Imaginary Quadratic Euclidean Domains
In this paper we generalize the shift radix systems to finite dimensional Hermitian vector spaces. Here the integer lattice is replaced by the direct sum of imaginary quadratic Euclidean domains. We prove in two cases that the set of one dimensional Euclidean shift radix systems with finiteness property is contained in a circle of radius 0.99 around the origin. Thus their structure is much simp...
متن کاملWeak Metrics on Euclidean Domains
A weak metric on a set is a function that satisfies the axioms of a metric except the symmetry and the separation axioms. The aim of this paper is to present some interesting weak metrics and to study some of their properties. In particular, we introduce a weak metric, called the Apollonian weak metric, on any subset of a Euclidean space which is either bounded or whose boundary is unbounded. W...
متن کاملEuclidean Functions of Computable Euclidean Domains
We study the complexity of (finitely-valued and transfinitely-valued) Euclidean functions for computable Euclidean domains. We examine both the complexity of the minimal Euclidean function and any Euclidean function. Additionally, we draw some conclusions about the proof-theoretical strength of minimal Euclidian functions in terms of Reverse Mathematics.
متن کاملIrreducible Polynomials of given Forms
We survey under a unified approach on the number of irreducible polynomials of given forms: xn + g(x) where the coefficient vector of g comes from an affine algebraic variety over Fq . For instance, all but 2 log n coefficients of g(x) are prefixed. The known results are mostly for large q and little is know when q is small or fixed. We present computer experiments on several classes of polynom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 1980
ISSN: 0161-1712,1687-0425
DOI: 10.1155/s0161171280000026